#include<bits/stdc++.h>
using namespace std;

int r[100005];
int attacked[100005];
int cnt;
int n;

void attack()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            if (r[i]>=r[j]) continue;
            if (attacked[j]==0)
            {
                attacked[j]=1;
                cnt++;
                break;
            }
        }
    }
}

int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>r[i];
    }
    sort(r+1,r+1+n);
    attack();
    cout<<n-cnt;
    return 0;
}
